Pruning of Crt-sub-trees

نویسندگان

  • ROMAIN ABRAHAM
  • HUI HE
  • Abraham
  • Delmas
چکیده

We study the pruning process developed by Abraham and Delmas (2012) on the discrete Galton-Watson sub-trees of the Lévy tree which are obtained by considering the minimal sub-tree connecting the root and leaves chosen uniformly at rate λ, see Duquesne and Le Gall (2002). The tree-valued process, as λ increases, has been studied by Duquesne and Winkel (2007). Notice that we have a tree-valued process indexed by two parameters the pruning parameter θ and the intensity λ. Our main results are: construction and marginals of the pruning process, representation of the pruning process (forward in time that is as θ increases) and description of the growing process (backward in time that is as θ decreases) and distribution of the ascension time (or explosion time of the backward process) as well as the tree at the ascension time. A by-product of our result is that the super-critical Lévy trees independently introduced by Abraham and Delmas (2012) and Duquesne and Winkel (2007) coincide. This work is also related to the pruning of discrete Galton-Watson trees studied by Abraham, Delmas and He (2012).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Continuum - Tree - Valued Markov Process

We present a construction of a Lévy continuum random tree (CRT) associated with a super-critical continuous state branching process using the so-called exploration process and a Girsanov theorem. We also extend the pruning procedure to this super-critical case. Let ψ be a critical branching mechanism. We set ψθ(·) = ψ(·+ θ)− ψ(θ). Let Θ = (θ∞,+∞) or Θ = [θ∞,+∞) be the set of values of θ for whi...

متن کامل

A Trade-Off Between Depth and Impurity for Pruning Decision Trees

Most pruning methods for decision trees minimize a classification error rate. In uncertain domains, some sub-trees which do not lessen the error rate can be relevant to point out some populations of specific interest or to give a representation of a large data file. We propose here a new pruning method (called pruning) which takes into account the complexity of sub-trees and which is able to ke...

متن کامل

Using Impurity and Depth for Decision Trees Pruning

Most pruning methods for decision trees minimize a classification error rate. In uncertain domains, some subtrees which do not lessen the error rate can be relevant to point out some populations of specific interest or to give a representation of a large data file. We propose here a new pruning method (called pruning) which takes into account the complexity of sub-trees and which is able to kee...

متن کامل

The Effect of Fruit Trees Pruning Waste Biochar on some Soil Biological Properties under Rhizobox Conditions

The pyrolysis of fruit trees Pruning waste to be converted to biochar with microbial inoculation is a strategy improving the biological properties in calcareous soils. In order to investigate the biochar effect on some soil biological properties of the soil in the presence of microorganisms, a factorial experiment was carried out in a completely randomized design in the rhizobox under greenhous...

متن کامل

Pruning a Lévy continuum random tree

Given a general critical or sub-critical branching mechanism, we define a pruning procedure of the associated Lévy continuum random tree. This pruning procedure is defined by adding some marks on the tree, using Lévy snake techniques. We then prove that the resulting sub-tree after pruning is still a Lévy continuum random tree. This last result is proved using the exploration process that codes...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012